#!/usr/bin/env python3
# -*- coding:UTF-8 -*-
##########################################################################
# File Name: optimal_binary_tree.py
# Author: cx
# Created Time: Wed Nov 13 20:39:59 2024
##########################################################################

a = []
a.extend([50]*500)
a.extend([60]*1500)
a.extend([70]*4000)
a.extend([80]*3000)
a.extend([90]*1000)

count = 0

def f():
  global count
  count+=1
  return True


for i in a:
  if f() and i < 80:
    if f() and i < 70:
      if f() and i < 60:
        continue
      else:
        continue
    else:
      continue
  else:
    if f() and i < 90:
      continue
    else:
      continue

#for i in a:
#  if f() and i < 60:
#    continue
#
#  if f() and i < 70:
#    continue
#
#  if f() and i < 80:
#    continue
#
#  if f() and i < 90:
#    continue
#  if  i >= 90:
#    continue

print(count)
  
